On the Gaussian Watermarking Game

نویسندگان

  • Aaron Cohen
  • Amos Lapidoth
چکیده

We compute the value of the watermarking game for a Gaussian covertext and squarederror distortions. Both the public version of the game (covertext known to neither attacker nor decoder) and the private version of the game (covertext unknown to attacker but known to decoder) are treated. Surprisingly, the two versions yield identical values.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Capacity of the Vector Gaussian Watermarking Game

We compute the coding capacity of the watermarking game for a vector Gaussian covertext and squared-error distortions. As with a scalar Gaussian covertext [1], the capacity does not depend on knowledge of the covertext at the decoder. Unlike the scalar version, an attacker based on the rate distortion solution (i.e. optimal compression) is suboptimal.

متن کامل

Practical watermarking scheme based on wide spread spectrum and game theory

In this paper, we consider the implementation of robust watermarking scheme for non i.i.d. Gaussian signals and distortion based on perceptual metrics. We consider this problem as a communication problem and formulated it as a game between an attacker and an embedder in order to establish its theoretical performance. We first show that known parallel Gaussian channels technique does not lead to...

متن کامل

Nonadditive Gaussian watermarking and its application to wavelet-based image watermarking

This paper extends our recent game-theoretic approach [1] to design and embed watermarks in Gaussian signals in the presence of an adversary. The detector solves a binary hypothesis testing problem. The system is designed to minimize probability of error under the worst-case attack in a prescribed class of attacks. In this paper, the embedder is allowed to filter the host signal and add a water...

متن کامل

Optimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling

This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...

متن کامل

The Fisher information game for optimal design of synchronization patterns in blind watermarking

This paper develops an optimization methodology for designing and embedding synchronization patterns in images, for watermarking applications in which the host image is not available the decoder. Optimality is in the sense of a certain Fisher information game between the embedder and the attacker. Analytical solutions are derived for problems involving translation, rotation, linear filtering, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000